Infinite families of 3-designs from a type of five-weight code
نویسنده
چکیده
It has been known for a long time that t-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a t-design. While a lot of progress in the direction of constructing codes from t-designs has been made, only a small amount of work on the construction of t-designs from codes has been done. The objective of this paper is to construct infinite families of 2-designs and 3-designs from a type of binary linear codes with five-weights. The total number of 2-designs and 3-designs obtained in this paper are exponential in any odd m and the block size of the designs varies in a huge range.
منابع مشابه
Infinite families of $t$-designs from a type of five-weight codes
It has been known for a long time that t-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a t-design. While a lot of progress in the direction of constructing codes from t-designs has been made, only a small amount of work on the construction of t-designs from codes has been done. The objective of this paper is to c...
متن کاملInfinite families of 2-designs and 3-designs from linear codes
The interplay between coding theory and t-designs started many years ago. While every t-design yields a linear code over every finite field, the largest t for which an infinite family of t-designs is derived directly from a linear or nonlinear code is t = 3. Sporadic 4-designs and 5-designs were derived from some linear codes of certain parameters. The major objective of this paper is to constr...
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کاملConstructions for generalized Steiner systems GS (3, 4, v , 2)
Generalized Steiner systems GS (3, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance three, in which each codeword has length v and weight four. Not much is known for GS (3, 4, v, 2)s except for a recursive construction and two small designs for v = 8, 10 given by Etzion. In this paper, more s...
متن کاملSeveral Classes of Trace Codes With Either Optimal Two Weights or a Few Weights over $\mathbb{F}_{q}+u\mathbb{F}_{q}$
Abstract. Let p be a prime number, q = p for a positive integer s. For any positive divisor e of q− 1, we construct an infinite families codes of dimension 2m with few Lee-weight. These codes are defined as trace codes over the ring R = Fq + uFq, u 2 = 0. Using Gauss sums, their Lee weight distribution is provided. When gcd(e,m) = 1, we obtain an infinite family of two-weight codes which meet t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 86 شماره
صفحات -
تاریخ انتشار 2018